Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs
نویسندگان
چکیده
منابع مشابه
Maximal Independent Set Based Approach for Graph Coloring Problem
Graph coloring problem is a well-known NP-complete problem and there are many approaches proposed to solve this problem. For a graph coloring algorithm to be efficient, it must color the input graph with minimum colors and must also find the solution in the minimum possible time. Heuristic approaches emphasize on the time complexity while the exact approaches concentrate on the number of colors...
متن کاملParallel algorithms for the maximal independent set problem in graphs
In this paper we describe the randomized parallel algorithm proposed by Blelloch et al. [BFS12] to compute a Maximal Independent Set (MIS) of a given graph. We implemented their algorithm as well as the fastest sequential algorithm and compared their performance with different input graphs. Furthermore, we compared the number of rounds in both the sequential and parallel algorithms and present ...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملApproximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
A box graph is the intersection graph of a finite set of orthogonal rectangles in the plane. The problem of whether or not the maximum independent set problem (MIS for short) for box graphs can be approximated within a substantially sub-logarithmic factor in polynomial time has been open for several years. We show that for box graphs on n vertices which have an independent set of size Ω(n/ log ...
متن کاملThe Maximum Independent Set Problem in Planar Graphs
We study the computational complexity of finding a maximum independent set of vertices in a planar graph. In general, this problem is known to be NP-hard. However, under certain restrictions it becomes polynomial-time solvable. We identify a graph parameter to which the complexity of the problem is sensible and produce a number of both negative (intractable) and positive (solvable in polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2020
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2020.10.007